Embedding nearly decomposable matrices into certain staircase matrices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

r-Indecomposable and r-Nearly Decomposable Matrices

Let n, r be integers with 0 ≤ r ≤ n− 1. An n×n matrix A is called r-partly decomposable if it contains a k×l zero submatrix with k+l = n−r+1. A matrix which is not r-partly decomposable is called r-indecomposable (shortly, r-inde). Let Eij be the n × n matrix with a 1 in the (i, j) position and 0’s elsewhere. If A is r-indecomposable and, for each aij 6= 0, the matrix ∗Research supported by Nat...

متن کامل

Nearly positive matrices

Nearly positive matrices are nonnegative matrices which, when premultiplied by orthogonal matrices as close to the identity as one wishes, become positive. In other words, all columns of a nearly positive matrix are mapped simultaneously to the interior of the nonnegative cone by mutiplication by a sequence of orthogonal matrices converging to the identity. In this paper, nearly positive matric...

متن کامل

Generalized Drazin inverse of certain block matrices in Banach algebras

Several representations of the generalized Drazin inverse of an anti-triangular block matrix in Banach algebra are given in terms of the generalized Banachiewicz--Schur form.  

متن کامل

Quasi{lumpability, Lower Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains

In this paper, it is shown that nearly completely decomposable (NCD) Markov chains are quasi{lumpable. The state space partition is the natural one, and the technique may be used to compute lower and upper bounds on the stationary probability of each NCD block. In doing so, a lower bounding nonnegative coupling matrix is employed. The nature of the stationary probability bounds is closely relat...

متن کامل

E-Clean Matrices and Unit-Regular Matrices

Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1990

ISSN: 0024-3795

DOI: 10.1016/0024-3795(90)90118-v